A Logically Complete Reasoning Maintenance System Based on a Logical Constraint Solver
نویسندگان
چکیده
This paper presents a logically complete assumption based truth maintenance system (ATMS) that is part of a complex blast furnace computer aided piloting system [ 5 ] . This system is built on an e cient and logically complete propositional constraint solver that has been successfully used for industrial applications in computer aided design.
منابع مشابه
Exploiting Locality in a TMS
This paper presents a new approach for exploiting Truth Maintenance Systems(TMSs) which makes them simpler to use without necessarily incurring a substantial performance penalty. The basic intuition behind this approach is to convey the locality of the knowledge representation of the problem solver to the TMS. The TMS then uses this locality information to control and restrict its inferences. T...
متن کاملOsitional Onstraint 0 Ta
We present an efficient method for inferring facts from a propositional knowledge base, which is not required to be in conjunctive normal form. This logically-incomplete method, called propositional fact propagation, is more powerful and efficient than some forms of boolean constraint propagation. Hence, it can be used for tractable deductive reasoning in many AI applications, including various...
متن کاملToward a Logically Complete Fixpoint Semantics for Constraint Handling Rules
In this paper, we address the problem of defining a fixpoint semantics for Constraint Handling Rules (CHR) that captures the behavior of both simplification and propagation rules in a sound and complete way with respect to their declarative semantics. Firstly, we show that the logical reading of states with respect to a set of simplification rules can be characterized by a least fixpoint over t...
متن کاملSemantics of an Anytime Family of Reasoners
An anytime family of propositional reasoners is a sequenceR0;R1; : : : of inference relations such that each Ri is sound, tractable, and makes more inferences than Ri 1, and each theory has a complete reasoner in the family. Anytime families are useful for resource-bounded reasoning in knowledge representation systems. Although several anytime families have been proposed in the literature, only...
متن کاملFLUX: A logic programming method for reasoning agents
FLUX is a programming method for the design of agents that reason logically about their actions and sensor information in the presence of incomplete knowledge. The core of FLUX is a system of Constraint Handling Rules, which enables agents to maintain an internal model of their environment by which they control their own behavior. The general action representation formalism of the uent calculus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991